An acceleration of the Niederreiter factorization algorithm in characteristic $2$
نویسندگان
چکیده
منابع مشابه
An Acceleration of the Niederreiter Factorization Algorithm in Characteristic
A new deterministic factorization algorithm for polynomials over finite fields was recently developed by Niederreiter. The bottleneck in this algorithm is the last stage in which the irreducible factors of the polynomial are derived from the solutions of a system of linear equations. In this paper, we consider finite fields of characteristic 2, and we show that in this case there is a more effi...
متن کاملan investigation of the types of text reduction in subtitling: a case study of the persian film gilaneh with english subtitles
چکیده ندارد.
15 صفحه اولFactorization of the Characteristic Polynomial
We introduce a new method for showing that the roots of the characteristic polynomial of a finite lattice are all nonnegative integers. Our main theorem gives two simple conditions under which the characteristic polynomial factors in this way. We will see that Stanley’s Supersolvability Theorem is a corollary of this result. We can also use this method to demonstrate the factorization of a poly...
متن کاملSatoh's algorithm in characteristic 2
We give an algorithm for counting points on arbitrary ordinary elliptic curves over finite fields of characteristic 2, extending the O(log q) method given by Takakazu Satoh, giving the asymptotically fastest point counting algorithm known to date.
متن کاملThe Sea Algorithm in Characteristic 2
The Schoof-Elkies-Atkin algorithm counts the number of rational points on elliptic curves over finite fields. This paper presents a number of optimizations specific for the characteristic two case. We give a detailed description of the computation of modular polynomials over F2n and the search for an eigenvalue in the Elkies algorithm. With our implementation, we were able to count the number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1994
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1994-1218344-8